منابع مشابه
Gaussian Mersenne and Eisenstein Mersenne primes
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem. Other properties of Gaussian Mersenne norms that contribute to the search for large primes are given....
متن کاملArtin Reciprocity and Mersenne Primes
On March 3, 1998, the centenary of Emil Artin was celebrated at the Universiteit van Amsterdam. This paper is based on the two morning lectures, enti-tled`Artin reciprocity and quadratic reciprocity' and`Class eld theory in practice', which were delivered by the authors. It provides an elementary introduction to Artin reciprocity and illustrates its practical use by establishing a recently obse...
متن کاملThree New Mersenne Primes and a Statistical Theory
If p is prime, Mp = 2P — 1 is called a Mersenne number. If ui = 4 and «<+1 = Mj+i — 2, then M„ is prime if and only if uv-i m 0(mod Mp). This is called the Lucas test (see Lehmer [4]). The primes Mom , M mi, and Mu2W which are now the largest known primes, were discovered by Illiac II at the Digital Computer Laboratory of the University of Illinois. The computing times were 1 hour 23 minutes, 1...
متن کاملAn elliptic curve test for Mersenne primes
Let l ≥ 3 be a prime, and let p = 2 − 1 be the corresponding Mersenne number. The Lucas-Lehmer test for the primality of p goes as follows. Define the sequence of integers xk by the recursion x0 = 4, xk = x 2 k−1 − 2. Then p is a prime if and only if each xk is relatively prime to p, for 0 ≤ k ≤ l − 3, and gcd(xl−2, p) > 1. We show, in the first section, that this test is based on the successiv...
متن کاملOverpseudoprimes, Mersenne Numbers and Wieferich Primes
We introduce a new class of pseudoprimes-so called ”overpseudoprimes” which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n,we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2 − 1, where p is prime, and squa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1962
ISSN: 0025-5718
DOI: 10.2307/2003068